The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution

نویسنده

  • Ward Whitt
چکیده

By exploiting an infinite-server-model lower bound, we show that the tails of the steadystate and transient waiting-time distributions in the M/GI/s queue with unlimited waiting room and the first-come first-served discipline are bounded below by tails of Poisson distributions. As a consequence, the tail of the steady-state waiting-time distribution is bounded below by a constant times the sth power of the tail of the service-time stationary-excess distribution. We apply that bound to show that the steady-state waiting-time distribution has a heavy tail (with appropriate definition) whenever the service-time distribution does. We also establish additional results that enable us to nearly capture the full asymptotics in both light and heavy traffic. The difference between the asymptotic behavior in these two regions shows that the actual asymptotic form must be quite complicated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The heavy-tailed heavy-traffic machine-repairman problem: A GI/G/2 Queue

Recent research in queuing focuses more on the impacts of heavy-tailed service times, neglecting the fact that stochastic inter-arrival times are often heavy-tailed as well. We investigate the impacts of heavy-tailed gamma inter-arrival time distributions on the waiting-time distribution of a GI/G/2 queue, and simulate the tail properties of waiting-time distribution using real data.

متن کامل

A single server perishable inventory system with N additional options for service

This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...

متن کامل

Heavy-traffic Analysis for the /g/1$ Queue with Heavy-tailed Distributions Heavy-traac Analysis for the Gi=g=1 Queue with Heavy-tailed Distributions

We consider a GI=G=1 queue in which the service time distribution and/or the interarrival time distribution has a heavy tail, i.e., a tail behaviour like t ? with 1 < 2, so that the mean is nite but the variance is innnite. We prove a heavy-traac limit theorem for the distribution of the stationary waiting time W. If the tail of the service time distribution is heavier than that of the interarr...

متن کامل

Heavy-traffic Limit Theorems for the Heavy-tailed Gi/g/1 Queue Heavy-traac Limit Theorems for the Heavy-tailed Gi/g/1 Queue

The classic GI=G=1 queueing model of which the tail of the service time and/or the interarrival time distribution behaves as t ?v S(t) for t ! 1, 1 < v < 2 and S(t) a slowly varying function at innnity, is investigated for the case that the traac load a approaches one. Heavy-traac limit theorems are derived for the case that these tails have a similar behaviour at innnity as well as for the cas...

متن کامل

Simulating Tail Probabilities in GI/GI.1 Queues and Insurance Risk Processes with Sub Exponential Distributions

This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The interarrival times can have any distribution with a nite mean. The problem of estimating in nite horizon ruin probabilities in insurance risk processes with heavy-tailed claims can be transformed into the same framework. It is well-k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2000